A Computational Procedure for on Expanded Steiner-Weber Problem of Optimal Location

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A novel computational procedure based on league championship algorithm for solving an inverse heat conduction problem

Inverse heat conduction problems, which are one of the most important groups of problems, are often ill-posed and complicated problems, and their optimization process has lots of local extrema. This paper provides a novel computational procedure based on finite differences method and league championship algorithm to solve a one-dimensional inverse heat conduction problem. At the beginning, we u...

متن کامل

On Newton's Method for the Fermat-Weber Location Problem

This paper considers the Fermat-Weber location problem. It is shown that, after a suitable initialization, the standard Newton method can be applied to the Fermat-Weber problem and is globally and locally quadratically convergent. A numerical comparison with the popular Weiszfeld algorithm shows that Newton’s method is significantly more efficient than the Weiszfeld scheme.

متن کامل

efficient methods for goal square weber location problem

in this paper, we consider a special case of weber location problem which we call goal location problem. the weber location problem asks to find location of a point in the plane such that the sum of weighted distances between this point and n existing points is minimized. in the goal location problem each existing point pi has a relevant radius ri and it’s ideal for us to locate a new facility o...

متن کامل

A modified Weiszfeld algorithm for the Fermat-Weber location problem

This paper gives a new, simple, monotonically convergent, algorithm for the Fermat-Weber location problem, with extensions covering more general cost functions.

متن کامل

Solving single facility goal Weber location problem using stochastic optimization methods

Location theory is one of the most important topics in optimization and operations research. In location problems, the goal is to find the location of one or more facilities in a way such that some criteria such as transportation costs, customer traveling distance, total service time, and cost of servicing are optimized. In this paper, we investigate the goal Weber location problem in which the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Review of Regional Studies

سال: 1975

ISSN: 1553-0892,0048-749X

DOI: 10.52324/001c.10395